Probabilistic Timed Behavior Trees
نویسندگان
چکیده
The Behavior Tree notation has been developed as a method for systematically and traceably capturing user requirements. In this paper we extend the notation with probabilistic behaviour, so that reliability, performance, and other dependability properties can be expressed. The semantics of probabilistic timed Behavior Trees is given by mapping them to probabilistic timed automata. We gain advantages for requirements capture using Behavior Trees by incorporating into the notation an existing elegant specification formalism (probabilistic timed automata) which has tool support for formal analysis of probabilistic user requirements.
منابع مشابه
Efficient Approximate Symbolic Reachability of Discrete-timed Digital Circuits
Timed reachability analysis of gate-level circuits is important in several applications. In this paper, we present techniques for efficient approximate symbolic reachability of circuits assuming discrete delays of gates. We exploit local interactions among gates to develop a highly scalable algorithm for over-approximating the set of timed reachable states. We present a scheme of successive ove...
متن کاملProbabilistic analysis of the asymmetric digital search trees
In this paper, by applying three functional operators the previous results on the (Poisson) variance of the external profile in digital search trees will be improved. We study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the Poissonized variance, since the probability distribution o...
متن کاملTrace Expressiveness of Timed and Probabilistic Automata
Automata expressiveness is an essential feature in understanding which of the formalisms available should be chosen for modelling a particular problem. Probabilistic and stochastic automata are suitable for modelling systems exhibiting probabilistic behaviour and their expressiveness has been studied relative to non-probabilistic transition systems and Markov chains. In this paper, we consider ...
متن کاملInvited Talk: Extensions of Graph Transformation Systems for Timed, Continuous, and Probabilistic Behavior
Graph transformation systems can be employed to describe systems with complex structural dynamics which states can be captured by attributed graphs. However, like many other standard computer science models such as automata in their basic form time, continuous behavior, or probabilistic behavior are not supported. In this talk we will report on a number of extensions for graph transformation sy...
متن کاملTimed Automata with Polynomial Delay and their Expressiveness
We consider previous models of Timed, Probabilistic and Stochastic Timed Automata, we introduce our model of Timed Automata with Polynomial Delay and we characterize the expressiveness of these models relative to each other. Timed and probabilistic automata may be used for modelling systems that exhibit timed and probabilistic behaviour as diverse as safety-critical navigation, web security, al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007